#include<bits/stdc++.h>
using namespace std;
int val[110110];
bool atd[110110]={0};
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d",&val[i]);
    sort(val,val+n);
    int nowi=0,dcnt=0;
    while(nowi<n){
        int t=val[nowi];
        auto num=upper_bound(val,val+n,t);
        if(num-val>=n)goto lab;
        if(atd[num-val]){
            while(atd[num-val]){
                num++;
                if(num-val>=n)goto lab;
            }
        }
        atd[num-val]=true;
        dcnt++;
        nowi++;
    }
    lab:
        printf("%d",n-dcnt);
    return 0;
}
